Complexity and Hierarchy in Truth Predicates∗

نویسنده

  • Michael Glanzberg
چکیده

Since seminal work of Tarski (e.g. Tarski, 1935), hierarchies have been much discussed in the literature on truth and paradox. Especially in recent years, this discussion has been decidedly negative. Tarski’s hierarchy of languages is sometimes described as the “orthodox” response to the Liar paradox (e.g. Kripke, 1975), but it is an orthodoxy many authors have gone to great lengths to avoid. Frequently, the unpalatability of hierarchies is taken for granted, and the main task is taken to be developing theories of truth that avoid them. In this paper, I shall speak in favor of hierarchies. I shall argue that hierarchies are more well-motivated and can provide better and more workable theories than is often assumed. I shall not argue here that hierarchies are inevitable (though I have argued that elsewhere); rather, I shall argue that if we wind up with one, that is not by itself a bad result. Along the way, I shall sketch the sort of hierarchy I believe is plausible and defensible, which is different in important respects from the orthodox Tarskian one. My defense of hierarchies will assume a particular view of the nature of truth that is fundamentally ‘inflationary’ and sees truth as a substantial semantic concept. My main thesis will be that if one adopts this view of truth, hierarchies arise naturally. In contrast, if you adopt a deflationist line, hierarchies are much less plausible, and certainly lack motivation. As a corollary of these claims, we will see an important way in which theorizing

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On truth-table reducibility to SAT and the difference hierarchy over NP

We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility via Boolean formulas to SAT and the same as log space Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. Finally, we show that the infinite difference hierarc...

متن کامل

A Kripkean Approach to Unknowability and Truth

We consider a language containing partial predicates for subjective knowability and truth. For this language, inductive hierarchy rules are proposed which build up the extension and anti-extension of these partial predicates in stages. The logical interaction between the extension of the truth predicate and the anti-extension of the knowability predicate is investigated.

متن کامل

Predicate Characterizations in the Polynomial-Size Hierarchy

The polynomial-size hierarchy is the hierarchy of ‘minicomplexity’ classes which correspond to two-way alternating finite automata with polynomially many states and finitely many alternations. It is defined by analogy to the polynomial-time hierarchy of standard complexity theory, and it has recently been shown to be strict above its first level. It is well-known that, apart from their definiti...

متن کامل

A Hierarchy Based on a Type Two Object

The object of hierarchy theory is to break down certain classes of predicates into subclasses of gradually increasing complexity. An excellent example is furnished by the hyperarithmetical hierarchy. Here each class in the hierarchy is obtained from the previous class by adding a single number quantifier. The Souslin-Kleene theorem [2, XXIV] then tells us that the predicates occurring in the hi...

متن کامل

The Exact Strength of the Class Forcing Theorem

The class forcing theorem, which asserts that every class forcing notion P admits a forcing relation P, that is, a relation satisfying the forcing relation recursion—it follows that statements true in the corresponding forcing extensions are forced and forced statements are true—is equivalent over Gödel-Bernays set theory GBC to the principle of elementary transfinite recursion ETROrd for class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012